An hybrid parallel algorithm for solving tridiagonal linear systems
نویسنده
چکیده
In this paper we describe an hybrid algorithm for an even number of processors based on an algorithm for two processors and the Overlapping Partition Method for tridiagonal systems. Moreover, we compare this hybrid method with the Partition Wang’s method in a BSP computer. Finally, we compare the theoretical computation cost of both methods for a Cray T3D computer, using the cost model that BSP model provides. Key-words: Tridiagonal linear systems, BSP, Wang’s method, Overlapping Partition (OPM) method.
منابع مشابه
An hybrid parallel algorithm for solving tridiagonal linear systems
In this paper we describe an hybrid algorithm for an even number of processors based on an algorithm for two processors and the Overlapping Partition Method for tridiagonal systems. Moreover, we compare this hybrid method with the Partition Wang’s method in a BSP computer. Finally, we compare the theoretical computation cost of both methods for a Cray T3D computer, using the cost model that BSP...
متن کاملAn iteration-based hybrid parallel algorithm for tridiagonal systems of equations on multi-core architectures
An optimized parallel algorithm is proposed to solve the problem occurred in the process of complicated backward substitution of cyclic reduction during solving tridiagonal linear systems. Adopting a hybrid parallel model, this algorithm combines the cyclic reduction method and the partition method. This hybrid algorithm has simple backward substitution on parallel computers comparing with the ...
متن کاملA Parallel Algorithm for Circulant Tridiagonal Linear Systems
In this paper, based upon the divide-and-conquer strategy, we propose a parallel algorithm for solving the circulant tridiagonal systems, which is simpler than the two previous algorithms proposed by Agui and Jimenez ( 1995) and Chung et al. ( 1995). Our algorithm can be easily generalized to solve the tridiagonal systems, the block-tridiagonal systems, and the circulant block-tridiagonal syste...
متن کاملHybrid artificial immune system and simulated annealing algorithms for solving hybrid JIT flow shop with parallel batches and machine eligibility
This research deals with a hybrid flow shop scheduling problem with parallel batching, machine eligibility, unrelated parallel machine, and different release dates to minimize the sum of the total weighted earliness and tardiness (ET) penalties. In parallel batching situation, it is supposed that number of machine in some stages are able to perform a certain number of jobs simultaneously. First...
متن کاملA Parallel Algorithm for Solving Tridiagonal Linear Systems on Distributed-Memory Multiprocessors
The coarse-grainded architecture model has been proposed to be a model of iently close existing parallel machines. Under this model we design a ommunication-efficient parallel algorithm for the solution of tridiagonal linear systems with n eq indicating the efficiency and scalability of proposed algorithm.
متن کامل